Automatically Discovering Euler's Identity via Genetic Programming

نویسنده

  • Konstantine Arkoudas
چکیده

We show that by using machine learning techniques (genetic programming, in particular), Euler’s famous identity (V −E+F = 2) can be automatically discovered from a limited amount of data indicating the values of V , E, and F for a small number of polyhedra—the five platonic solids. This result suggests that mechanized inductive techniques have an important role to play in the process of doing creative mathematics, and that large amounts of data are not necessary for the extraction of important regularities. Genetic programming was implemented from scratch in SML-NJ.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous Discovery of Detectors and a Way of Using the Detectors via Genetic Programming

Conventional approaches to problems of pattern recognition and machine learning usually require that the user hand-craft detectors for key features in the problem environment. Conventional approaches often additionally require the user to specify in advance the size and shape of the eventual way of combining the detectors into a compete solution. This paper describes a general approach for simu...

متن کامل

Harmonic Number Identities Via Euler’s Transform

We evaluate several binomial transforms by using Euler's transform for power series. In this way we obtain various binomial identities involving power sums with harmonic numbers.

متن کامل

Automated Discovery of Protein Motifs With Genetic Programming

Automated methods of machine learning may prove to be useful in discovering biologically meaningful information hidden in the rapidly growing databases of DNA sequences and protein sequences. Genetic programming is an extension of the genetic algorithm in which a population of computer programs is bred, over a series of generations, in order to solve a problem. Genetic programming is capable of...

متن کامل

Evolutionary Discovery of Arbitrary Self-replicating Structures

In this paper we describe our recent use of genetic programming methods to automatically discover CA rule sets that produce self-replication of arbitrary given structures. Our initial results have produced larger, more rapidly replicating structures than past evolutionary models while requiring only a small fraction of the computational time needed in past similar studies. We conclude that gene...

متن کامل

Euler's Formula via Potential Functions

A new proof of Euler's formula for polytopes is presented via an approach using potential functions. In particular, a connection between Euler's formula and the Morse relation from differential topology is established.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008